Efficient identification of log events in enterprise threat detection

ABSTRACT

A first set of log entries is identified. A plurality of log entry classes occurring in the first set of log entries is determined. Each log entry in a given log entry class has a same number, type, and ordering of components. A vector of component type identifiers is determined for each log entry class. Each identifier in a vector for a given log entry class identifies a position and type of a component included in a log entry belonging to the given log entry class. A classification tree is created using the vectors. An unclassified log entry not included in the first set of log entries is identified. A log entry class is assigned to the unclassified log entry using the classification tree to create a classified log entry. One or more security threat patterns are evaluated using the classified log entry.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a co-pending application of U.S. application Ser.No. 14/978,984, filed on Dec. 22, 2015 entitled “SYSTEM AND USER CONTEXTIN ENTERPRISE THREAT DETECTION”; and U.S. application Ser. No.14/978,963, filed on Dec. 22, 2015 entitled “KNOWLEDGE BASE INENTERPRISE THREAT DETECTION”; and U.S. application Ser. No. 14/978,995,filed on Dec. 22, 2015 entitled “LOG NORMALIZATION IN ENTERPRISE THREATDETECTION”; the entire contents of each and as a whole are incorporatedherein by reference.

BACKGROUND

A computing system may maintain a data log which documents events andother activities occurring within the computing system. The data log canbe stored, for example, in a file, database, or some other repository.Each entry in the data log can include a description of an event beinglogged, and a timestamp indicating the occurrence of the event. Theentries in the data log can correspond to transactions occurring withinthe computing system, error conditions, or other types of events.Identification of events in data logs is often inefficiently performed.

SUMMARY

The present disclosure relates to efficient identification of log eventsin enterprise threat detection.

A first set of log entries is identified. A plurality of log entryclasses occurring in the first set of log entries is determined. Eachlog entry in a given log entry class has a same number, type, andordering of components. A vector of component type identifiers isdetermined for each log entry class. Each identifier in a vector for agiven log entry class identifies a position and type of a componentincluded in a log entry belonging to the given log entry class. Aclassification tree is created using the vectors. An unclassified logentry not included in the first set of log entries is identified. A logentry class is assigned to the unclassified log entry using theclassification tree to create a classified log entry. One or moresecurity threat patterns are evaluated using the classified log entry.

Other implementations can include corresponding computer systems,apparatuses, and computer programs recorded on one or more computerstorage devices, each configured to perform the actions of the methods.A system of one or more computers can be configured to performparticular operations or actions by virtue of having software, firmware,hardware, or a combination of software, firmware, or hardware installedon the system that in operation causes or causes the system to performthe actions. One or more computer programs can be configured to performparticular operations or actions by virtue of including instructionsthat, when executed by data processing apparatus, cause the apparatus toperform the actions.

For example, one computer-implemented method includes: identifying afirst set of log entries; determining a plurality of log entry classesoccurring in the first set of log entries, each log entry in a given logentry class having a same number, type, and ordering of components;determining, for each log entry class, a vector of component typeidentifiers for a given log entry class, each identifier in the vectoridentifying a position and type of a component included in a log entrybelonging to the given log entry class; creating a classification treeusing the vectors; identifying an unclassified log entry not included inthe first set of log entries; assigning a log entry class to theunclassified log entry using the classification tree to create aclassified log entry; and evaluating one or more security threatpatterns using the classified log entry.

The foregoing and other implementations can each optionally include oneor more of the following features, alone or in combination:

A first aspect, combinable with the general implementation, whereinassigning a log entry class to the unclassified log entry using theclassification tree comprises evaluating tokens of the unclassified logentry in accordance with the classification tree.

A second aspect, combinable with the general implementation, wherein theclassification tree comprises a plurality of candidate log entryclasses, evaluating tokens of the unclassified log entry compriseseliminating candidate log entry classes from consideration until oneremaining candidate log entry class remains, and assigning the log entryclass comprises assigning the one remaining candidate log entry class tothe unclassified log entry.

A third aspect, combinable with the general implementation, wherein eachlog entry class is associated with a unique log entry class identifier.

A fourth aspect, combinable with the general implementation, whereineach log entry class identifier is included in a leaf node of theclassification tree.

A fifth aspect, combinable with the general implementation, wherein eachvector is represented in the classification tree as a path beginning ata root node and ending at a respective leaf node corresponding to thelog entry class associated with the vector.

A sixth aspect, combinable with the general implementation, wherein eachrespective non-leaf node of the classification tree corresponds to aparticular token position of the unclassified log entry and to one ormore candidate log entry classes that are each represented by a sub-pathof the classification tree beginning at the root node and ending at therespective non-leaf node.

A seventh aspect, combinable with the general implementation, whereineach branch of the classification tree is associated with a componenttype identifier of one or more vectors.

An eighth aspect, combinable with the general implementation, whereineach branch is associated with a test which evaluates a current token ofthe unclassified log message to determine whether the current tokenmatches a component type associated with the branch.

A ninth aspect, combinable with the general implementation, comprisingfollowing a respective branch to a next node of the classification treewhen an outcome of the test associated with the branch indicates a matchbetween the current token and the component type associated with thebranch.

A tenth aspect, combinable with the general implementation, whereinassigning the log entry class comprises determining that the next nodeis associated with the one remaining candidate log entry class and noother candidate log entry classes; and assigning the one remainingcandidate log entry class to the unclassified log entry.

The subject matter described in this specification can be implemented inparticular implementations so as to realize one or more of the followingadvantages. An unclassified log entry can be efficiently classifiedusing a classification tree. The classification tree can be used to ruleout candidate classes for the unclassified log entry until one candidateclass remains. The remaining candidate class can be assigned to theunclassified log entry. Classified log entries can be used to detectsecurity threats. Classified log entries can be used for log management.Classified log entries can be used for resolving problems occurring indistributed systems. Other advantages will be apparent to those ofordinary skill in the art.

The details of one or more implementations of the subject matter of thisspecification are set forth in the accompanying drawings and thedescription below. Other features, aspects, and advantages of thesubject matter will become apparent from the description, the drawings,and the claims.

DESCRIPTION OF DRAWINGS

FIG. 1 is a high-level architectural block diagram illustrating anexample distributed computing system (EDCS) for efficient identificationof log events in enterprise threat detection, according to animplementation.

FIG. 2 is a lower-level architectural block diagram illustratingadditional components of the EDCS of FIG. 1 for efficient identificationof log events in enterprise threat detection, according to animplementation.

FIGS. 3A and 3B illustrate an example log entry and a corresponding logentry structure, respectively, according to an implementation.

FIGS. 4A-4C illustrate an example log entry structure, an example logentry class vector, and example log entry component identifier mappings,respectively, according to an implementation.

FIG. 5A illustrates example log entry class vectors that respectivelycorrespond to first and second log entry classes, according to animplementation.

FIG. 5B illustrates example log entry component identifier mappings,according to an implementation.

FIG. 5C illustrates an example classification tree, according to animplementation.

FIG. 5D illustrates an example unclassified log entry, according to animplementation.

FIG. 6A illustrates an example classification tree that can be used todetermine whether a token of a raw log entry is a timestamp, accordingto an implementation.

FIG. 6B illustrates example date patterns, according to animplementation.

FIG. 7 illustrates an example algorithm for building a classificationtree, according to an implementation.

FIG. 8 is a flow chart of an example method for efficient identificationof log events in enterprise threat detection, according to animplementation.

FIG. 9 is a block diagram of an exemplary computer used in the EDCS,according to an implementation.

Like reference numbers and designations in the various drawings indicatelike elements.

DETAILED DESCRIPTION

The following detailed description is presented to enable any personskilled in the art to make, use, and/or practice the disclosed subjectmatter, and is provided in the context of one or more particularimplementations. Various modifications to the disclosed implementationswill be readily apparent to those skilled in the art, and the generalprinciples defined herein may be applied to other implementations andapplications without departing from scope of the disclosure. Thus, thepresent disclosure is not intended to be limited to the described and/orillustrated implementations, but is to be accorded the widest scopeconsistent with the principles and features disclosed herein.

FIG. 1 is a high-level architectural block diagram illustrating anexample distributed computing system (EDCS) 100 for the efficientidentification of log events in enterprise threat detection, accordingto an implementation. Log-providing systems 102 can generate varioustypes of log data, such as from automated processes and through the useof such systems by business users 104 and other users. The log-providingsystems 102 can include heterogeneous landscapes, business systems,interconnected systems, mobile and cloud-based systems, applications,network components (e.g., proxies, routers, switches), or any othersystem that generates log data. Log data can include, for example, datafrom user change logs, business transaction logs, change document logs,gateway logs, HTTP (Hypertext Transfer Protocol) server logs, readaccess logs, system logs, security audit logs, etc.

Log data generated by log-providing systems 102 can provide a wealth ofinformation regarding activities that occur within an application, adatabase, an operating system, or a network component, for example. Logdata can also include evidence of malicious activity performed, forexample, by an attacker user 106 or an attacking computing system (e.g.,a log providing system 102 used by the attacker user 106). A threatdetection system 108 can evaluate log data generated by thelog-providing systems 102 to identify potential security threats.

The log-providing systems 102 can provide log data to an event streamprocessor 110. The event stream processor 110 can, for example, provideone or more services to the log-providing systems 102 for providing logdata to the event stream processor 110. As illustrated, log data ispushed from the log providing system 102 to the event stream processor110 using a “push” service provided by the event stream processor 110.In other implementations, log data can be pulled or pushed/pulledto/from the log providing system 102 using a pull or push/pull serviceprovided by the event stream processor 110. In still otherimplementation, the event stream processor 110 can register with eachindividual log providing system 102 which provides a push and/or pullservice to allow the event stream processor 110 to access log data. Inother possible implementations, the push and/or pull services can beprovided by one or both of the log providing system 102 and the eventstream processor 110. As will be understood by those of ordinary skillin the art, other methods of transferring log data between thecomponents of the EDCS 100 are possible. These other methods, whereconsistent with this disclosure, are considered to be within the scopeof this disclosure.

Typically, the event stream processor 110 can normalize, filter,transform, and/or enrich log data, from multiple log-providing systems102, As described in more detail below, the event stream processor 110can classify received log data, such as log data received from alog-providing system 102 that does not initially have an identifiedstructure. For example, the event stream processor 110 can generate aclassification tree using training data provided by a systemadministrator 112 and use the classification tree to classify receivedlog entries.

The event stream processor 110 can provide data, including classifiedlog data, to the threat detection system 108. Note that data provided tothe threat detection system 108 can, similar to data transfer between alog providing system 102 and the event stream processor 110, beconfigured to be accessible using a push and/or pull service provided bythe event stream process or 110 and/or the threat detection system 108or another method consistent with this disclosure. The threat detectionsystem 108 can, for example, evaluate the classified log data todetermine whether the classified log data matches one or more threatdetection patterns that are defined, e.g., by a system administrator114, using one or more rules. A runtime component of the threatdetection system 108 can determine whether a received, classified logentry matches one or more rules. When a received, classified log entrymatches a rule, an alert can be generated, for example.

FIG. 2 is a lower-level architectural block diagram 200 illustratingadditional components of the EDCS of FIG. 1 for efficient identificationof log events in enterprise threat detection, according to animplementation. An event stream processor 202 (e.g., event streamprocessor 110) can receive log data, for example, from one or moreinternal systems 204 and/or from one or more third party systems 206(e.g., each of internal system 204 and third party system 206 as a loggenerating system 102). In the illustrated block diagram 200, theinternal systems 204 can, for example, communicate using HTTP with a webserver 208 which connects the internal systems 204 with the event streamprocessor 202. The web server 208 can forward log data to the eventstream processor 202. Third party systems 206 can forward log data tothe event stream processor 202 using, for example, User DatagramProtocol (UDP) or other protocol consistent with this disclosure.

An input stream component 210 can augment data received from theinternal systems 204 or third party systems 206 with user or systemcontext information. For example, the input stream component 210 can adda system identifier and other system context information to received logdata. As another example, the input stream component 210 can identify asystem-specific user identifier in received log data and add a globaluser context identifier to the received log data. The global usercontext identifier can be used to identify log data associated with aparticular user that is associated with multiple systems. Userinformation can be anonymized, such as with a user pseudonym. A database(DB) output adapter 212 can provide the augmented data to a threatdetection system 214 (e.g., threat detection system 108). A data window216 can be used by the event stream processor 202 to store data receivedfrom the threat detection system 214, such as configuration data usedfor the classification of received log data.

In some implementations and as illustrated in FIG. 2, the structure ofdata received from the internal systems 204 can be known by the eventstream processor 202 so that particular identification of log events isnot necessary. However, the structure of data received from the thirdparty systems 206 may be initially unknown by the event stream processor202. The runtime parser 218 can be configured to identify/classifyreceived log entries that have an unknown structure for the purposes ofenterprise threat detection.

In typical implementations, the runtime parser 218 can operate in twomodes: 1) a training mode in which the runtime parser 218 learns logentry patterns based on training data and builds a classification treeto be used for classifying log entries and 2) a production mode in whichthe runtime parser 218 classifies incoming log entries using theclassification tree.

In the training mode, the runtime parser 218 can identify a set oftraining log entries. For example, an administrator user (e.g., systemadministrator 112 of FIG. 1) can upload the training log entries. Theruntime parser 218 can evaluate the training log entries to determine aplurality of log entry classes occurring in the training log entries.Each log entry in a given log entry class has a same number, type, andordering of components, for example. Components can include itemsoccurring in a log message, such as a timestamp, user identifier, systemidentifier, IP (Internet Protocol) address, URL (Uniform ResourceLocator), variable text, literal text, or other items.

Using the training log entries, the runtime parser 218 can determine avector of component type identifiers for each determined log entryclass. A vector for a log entry class can represent the component typesincluded in log entries belonging to the log entry class. Eachidentifier in a vector can identify a position and type of a componentincluded in a log entry belonging to the log entry class associated withthe vector. As described in more detail below, the runtime parser 218can create a classification tree using the vectors to identify logevents in the received training log entries.

In the production mode, the runtime parser 218 can be used to identifyan unclassified log entry not included in the training log entries. Forexample, the runtime parser 218 can receive an unclassified log messagefrom a third party system 206. As described in more detail below, theruntime parser 218 can assign a log entry class to the unclassified logentry using the created classification tree to create a classified logentry. The classified log entry 214 can then be provided to the threatdetection system 214 to be used to evaluate one or more security threatpatterns.

The method used by the runtime parser 218 to use the classification treeto classify an unclassified log message can be referred to asfast-forward decision-making method. The fast-forward decision makingmethod can result in a faster classification of the unclassified logentry as compared to other methods, such as pattern-matching the fullraw unclassified log entry against known patterns. The fast-forwarddecision making method can include evaluating tokens of the unclassifiedlog message according to matching tests associated with theclassification tree. The matching tests can be used to eliminatecandidate log entries classes from consideration until, for example, onecandidate log entry class remains. The runtime parser 218 can thenassign the one remaining candidate log entry class to the unclassifiedlog entry. In other implementations, one or more remaining candidate logentry classes can remain that can be disambiguated using known orproprietary disambiguation-type algorithms to select the appropriate logentry class.

FIGS. 3A and 3B illustrate an example log entry 302 and a correspondinglog entry structure 303, respectively, according to an implementation.As will be understood by those of ordinary skill in the art, thisexample is only one of a myriad of possible log entries and log entrystructures. The example log entry 302 is provided for clarity andunderstanding and is not meant to limit the disclosure in any way. Thelog entry 302 includes multiple components, with each component beingeither literal text, variable text, or an instance of a particular datatype. For example, the log entry 302 includes a first timestamp 304 a, asecond timestamp 304 b, first variable text 304 c, a first IP address304 d, a literal “+” symbol 304 e, a time value 304 f, literal text 304g of “dhcpd bind update on”, a second IP address 304 h, literal text 304i of “got ack from”, second variable text 304 j, a literal “:” symbol304 k, and literal text 304 l of “xid mismatch”.

The log entry structure 303 represents the structure of the log entry302 and can be used to define a class that represents all log entriesthat conform to a same structure. The log entry structure 303 includessets of markup symbols (e.g., tags, “< >”) which indicate data types andpositions of components included in the log entry 302. The log entrystructure 303 includes a tag for each typed or variable data instanceincluded in the log entry 302. Literal text, literal symbols, and whitespace included in the log entry 302 is left unchanged in the log entrystructure 303.

For example, a first timestamp tag 308 a, a second timestamp tag 308 b,a first variable tag 308 c, a first IP tag 308 d, a time tag 308 f, asecond IP tag 308 h, and a second variable tag 308 j correspond to thefirst timestamp 304 a, the second timestamp 304 b, the first variabletext 304 c, the first IP address 304 d, the time value 304 f, the secondIP address 304 h, and the second variable text 304 j, respectively.Literal items 308 e, 308 g, 308 k, and 3081 respectively correspond tothe literal symbol 304 e, the literal text 308 g, the literal symbol 304k, and the literal text 304 l.

FIGS. 4A-4C illustrate an example log entry structure 401 (e.g., aportion of log entry structure 303), an example log entry class vector402, and example log entry component identifier mappings 403,respectively, according to an implementation. The log entry structure401 illustrates a structure of a particular class of log entries. Forexample, each log entry in the class has a same structure that includesa first timestamp, a second timestamp, variable text, a first IPaddress, a time value, and a second IP address respectivelycorresponding to tags 404 a, 404 b, 404 c, 404 d, 404 e, and 404 fincluded the log entry structure 401. Each log entry in the class alsoincludes literal text values “dhcpd” 404 g, “bind” 404 h, “update” 404i”, and “on” 404 j.

The log entry component identifier mappings 403 includes mappings ofunique identifiers to unique types of components included in the logentry structure 401. For example, a unique identifier is assigned toeach data type included in the log entry structure 401 (e.g.,<TimeStamp>, <Var>, <IP>, and <Time> are assigned identifiers of 0, 1,2, and 3, as illustrated by mapping entries 408 a, 408 b, 408 c, and 408d, respectively). Each literal text token included in the log entrystructure 401 is also assigned a unique identifier (e.g., mappingentries 408 e, 408 f, 408 g, and 408 h illustrate the mapping ofidentifiers 12, 13, 14, and 15 to the literal text values “dhcpd” 404 g,“bind” 404 h, “update” 404 i, and “on” 404 j, respectively). In someimplementations, literal symbols (e.g., “+”) and whitespace included inthe log entry structure 401 are not assigned identifiers in the logentry component identifier mappings 403.

The log entry class vector 402 is an identifier-based representation ofthe log entry structure 401, using identifiers from the log entrycomponent identifier mappings 403. As described in more detail below,the log entry class vector 402, and other log entry class vectors forother classes of log entries that may be discovered in a particular log,are used for creating a classification tree for the particular log. Thelog entry class vector 402 includes a series of identifiers, with eachidentifier corresponding to a type and position of a component of thelog entry structure 401.

For example, the vector element 410 a of “0” in the first position ofthe log entry class vector 402 corresponds to the <Timestamp> tag 404 aand the mapping entry 408 a. Similarly, vector elements 410 b, 410 c,410 d, 410 e, and 410 f respectively correspond to the tags 404 b, 404c, 404 d, 404 e, and 404 f, and to the mapping entries 408 a, 408 b, 408c, 408 d, and 408 c. Vector elements 410 g, 410 h, 410 i, and 410 jrespectively correspond to the literal text values “dhcpd” 404 g, “bind”404 h, “update” 404 i, and “on” 404 j, and to the mapping entries 408 e,408 f, 408 g, and 408 h, respectively.

FIG. 5A illustrates example log entry class vectors 502 and 504 thatrespectively correspond to first and second log entry classes, accordingto an implementation. The example log entry class vectors 502 and 504can be used to generate a classification tree (e.g., the classificationtree 509 described below with respect to FIG. 5C). The first and secondlog entry classes represent classes of log entries discovered intraining log data. The log entry class vector 502, which has anidentifier of “0” for the first log entry class as a last element 506,includes elements “0”, “3”, “4”, and “5” which each identify a type andposition of a component included in log entries that belong to the firstlog entry class. Similarly, the log entry class vector 504, which has anidentifier of “1” for the second log entry class as a last element 508,includes elements “0”, “3”, “1”, and “2” which each identify a type andposition of a component included in log entries that belong to thesecond log entry class. The vector elements included in the example logentry class vectors 502 and 504 can correspond to predefinedcomponent-identifier mappings.

FIG. 5B illustrates example log entry component identifier mappings 510,according to an implementation. Based on the log entry componentidentifier mappings 510, the elements “0”, “3”, “4”, and “5” of the logentry class vector 502 respectively represent timestamp, IP address,“xid” literal text, and “mismatch” literal text components that areincluded in log entries that are associated with the first log entryclass. Similarly, the elements “0”, “3”, “1”, and “2” of the log entryclass vector 504 respectively represent timestamp, IP address, time, andvariable text components that are included in the second log entryclass.

FIG. 5C illustrates an example classification tree 509, according to animplementation. The classification tree 509 includes a root node 512 andleaf nodes 514 and 516. The leaf node 514 corresponds to the second logentry class and is associated with a class identifier of “1”corresponding to the last element 508 of the log entry class vector 508.Similarly, the leaf node 516 corresponds to the first log entry classand is associated with a class identifier of “0” corresponding to thelast element 506 of the log entry class vector 506. The first log entryclass is represented in the classification tree 509 by a path from theroot node 512 to the leaf node 516, including intervening nodes 518,520, 522, and 524. The second log entry class is represented in theclassification tree 509 by a path from the root node 512 to the leafnode 514, including intervening nodes 518, 520, 526, and 528. Analgorithm that can be used to generate the classification tree 509 isdiscussed in more detail below with respect to FIG. 8.

FIG. 5D illustrates an example unclassified log entry 530, according toan implementation. The classification tree 509 can be used to classifythe unclassified log entry 530. The unclassified log entry 530 can be,for example, a raw log entry 530. A raw log entry is a text string, forexample, such as a line in an unstructured log. A runtime parser (e.g.,the runtime parser 218 described above with respect to FIG. 2) canevaluate the raw log entry 530 in accordance with the classificationtree 509.

Each node of the classification tree 509, including the root node 512and nodes 518-528, can be associated with one or more test functions,which are each configured to test a current token of an unclassified logentry regarding whether the token matches an expected component type.The expected types of tokens are identified based on the structure ofthe classification tree 509.

For example, each branch of the classification tree 509 identifies knowncomponent types that have occurred in training data at a particulartoken position of a training log entry. For example, a branch 532originating at the root node 512 indicates that training data logentries have started with a component of a type associated with anidentifier of “0” (e.g., a timestamp, as indicated by the log entrycomponent identifier mappings 510). The branch 532 is associated with atest which indicates whether a first token of an unclassified log entry(e.g., a first token 534 of the raw log entry 530) is of a timestampcomponent type. In some implementations, a test to determine whether atoken is a timestamp uses a nested classification tree, as described inmore detail below with respect to FIG. 7.

While classifying the raw log entry 530, the runtime parser can executethe test function associated with the timestamp component type,determine that the first token 534 is a timestamp, and follow the branch532 so that the node 518 is a current node under test. The node 518indicates that a current token position of the raw log entry 530 is “0”(e.g., a first token position, with token positions starting at zero),that the type of the first token has been identified as a component of atype “0” (e.g., timestamp), and that candidate classes of the raw logentry 530 at this point of classification are classes “0” and “1” (e.g.,the first and second log entry classes).

The runtime parser can identify a next token (e.g., a second token 536)of the raw log entry 530 and can determine that only one branch (e.g., abranch 538) originates from the node 518. The runtime parser canidentify a component type as (e.g., IP address) associated with acomponent type of “3” corresponding to the branch 538. The runtimeparser can execute a test associated with the IP address component typeto determine that the second token 536 matches an IP address. Based onthe successful outcome of the IP address test associated with the branch538, the runtime parser can follow the branch 538 so that the node 520is the current node under test.

The node 520 indicates that a current token position of the raw logentry 530 is “1” (e.g., a second token position), that the type of thesecond token has been identified as a component of a type “3” (e.g., anIP address), and that candidate classes of the raw log entry 530 at thispoint of classification are still the classes “0” and “1”. A branch 540and a branch 542 both originate from the node 520. The branches 540 and542 respectively indicate that training log entries have included both acomponent of type “4” (e.g., “xid” literal text) and a component of type“1” (e.g., a time value) as a third component of respective training logentries.

The runtime parser can identify a third token 544 of the raw log entry530 and a test function token associated with the branch 542 whichdetermines whether the third token 544 is a time value. The runtimeparser can perform the test associated with the branch 542 to determinethat the third token 544 is not a time value. Test functions can bewritten to determine, as efficiently as possible, whether a given tokendoes not match a particular component type. For example, the testfunction associated with the branch 542 can be written to determinewhether a given token starts with a non-numeric value. A time value canbe assumed to start with a numeric value, so detecting a non-numericvalue in a first character of a token can be a way to determine that thetoken is not a time value.

Based on determining that the third token 544 is not a time value, theruntime parser can identify and perform a test function associated withthe branch 540 which determines whether the third token 544 matches theliteral text “xid”. The runtime parser can determine that the thirdtoken 544 does match the literal text “xid” and based on thatdetermination, can follow the branch 540 so that the node 522 is thecurrent node under test.

The runtime parser can determine that the node 522 is associated withonly one remaining candidate class (e.g., a class “0”) to be assigned asthe class of the raw log entry 530. Because there is only one remainingcandidate class, the runtime parser can determine that furthernavigation of the classification tree 509 is unnecessary (e.g., thattests associated with branches 546 and 548 do not need to be performed).The runtime parser can use the classification tree to exclude other allother candidate classes other than the remaining candidate class, andcan therefore assign the remaining candidate class to the raw log entry530.

If, when performing each test in a set of tests associated with branchesoriginating from a node, the runtime parser determines that all tests inthe set have failed, the runtime parser can determine that the class ofthe raw log entry 530 is unknown. If unknown log entry types areencountered, additional training phases can be performed. Incrementaltraining data can be used to update the classification tree 509 torepresent additional training instances, for example.

FIG. 6A illustrates an example classification tree 600 that can be usedto determine whether a token of a raw log entry is a timestamp,according to an implementation. In some implementations, otherclassification trees can be used to determine whether a token matchesother types of components. Timestamp values can be in any of a varietyof formats, or patterns. A timestamp value can include variouscombinations of both date and time patterns, for example. Theclassification tree 600 can be used to represent combinations of dateand time patterns. However, for brevity of description and to assistunderstanding, the illustrated classification tree 600 represents twoexample date-only patterns that may be included in a timestamp.

FIG. 6B illustrates example date patterns 602 and 604, according to animplementation. The date pattern 602 (exemplified by a date sample 606of “17 Nov 15”) can be represented as a coded pattern 608 of “dd aaadd”, where a “d” represents a digit and an “a” represents a letter(e.g., the coded pattern 608 includes two digits representing a dayvalue, three characters representing a month value, and two digitsrepresenting the last two digits of a year value). Similarly, the datepattern 604 (exemplified by a date sample 610 of “11-17-15”) can berepresented as a coded pattern 612 of “dd-dd-dd” (e.g., the codedpattern 612 includes two digits representing a month value, a firstdash, two digits representing a day value, a second dash, and two digitsrepresenting the last two digits of a year value).

The coded patterns 608 and 612 are represented in the classificationtree 600. For example, the coded pattern 608 (and by association, thedate pattern 602) is represented by a path starting at a root node 614and ending at a leaf node 616. The coded pattern 612 (and byassociation, the date pattern 604) is represented by a path starting atthe root node 614 and ending at a leaf node 618.

The runtime parser can use the classification tree 600 to determinewhether a token matches a date pattern represented in the classificationtree 600. For example, the runtime parser can perform an “is digit” teston the first character of the token (e.g., as represented by a branch620). If the first character of the token is not a digit, the runtimeparser can determine that the token is not a date value. If the firstcharacter of the token is a digit, the runtime parser can follow thebranch 620 to proceed to a node 622. The node 622 indicates that boththe date pattern 602 and the date pattern 604 are still candidatepatterns, so the runtime parser can perform another “is digit” test onthe second character of the token (e.g., as represented by a branch624). If the second character of the token is not a digit, the runtimeparser can determine that the token is not a date value. If the secondcharacter of the token is a digit, the runtime parser can follow thebranch 624 to proceed to a node 626.

The node 626 indicates that both the date pattern 602 and the datepattern 604 are still candidate patterns. Both a branch 628 and a branch630 originate from the node 626. The runtime parser can perform a testcorresponding to the branch 628 to determine whether the third characterof the token is a space character. If the third character is a spacecharacter, the runtime parser can follow the branch 628 to a node 632.The node 632 indicates that only the date pattern 602 is a remainingcandidate pattern. Accordingly, the runtime parser 632 can classify thetoken as a date value. In some implementations, the pattern 602 is alsoassociated with the token.

If the third character is not a space character, the runtime parser canperform a test corresponding to the branch 630 to determine whether thethird character is a dash character. If the third character is a dashcharacter, the runtime parser can follow the branch 630 to a node 634.The node 634 indicates that only the date pattern 604 is a remainingcandidate pattern. Accordingly, the runtime parser 632 can classify thetoken as a date value. In some implementations, the pattern 604 is alsoassociated with the token. If the third character is not a dashcharacter, the runtime parser can determine that the token is not a datevalue, since no candidate patterns have matched the token.

As mentioned, the classification tree 600 can be expanded to representnumerous other patterns of dates and also date and time combinationsthat represent a timestamp. Accordingly, traversal of the classificationtree 600 can be more complex than what is illustrated. Regardless of thenumber of patterns represented, the classification tree 600 can beconfigured so that traversal of the classification tree 600 results inan earliest possible determination of whether a token represents a dateor timestamp pattern represented in the classification tree 600.

FIG. 7 illustrates an example algorithm 700 for building aclassification tree, according to an implementation. As will beunderstood by those of ordinary skill in the art, this example is onlyone of a myriad of possible algorithms consistent with this disclosure.The example algorithm 700 is provided for clarify and understanding andis not meant to limit the disclosure in any way. At line 1, the runtimeparser 218 creates a tree object. For example, the runtime parser 218can create a tree object representing the classification tree 600. Atline 2, the runtime parser 218 creates a root node object. For example,the runtime parser 218 can create a node object that represents the rootnode 612. At line 3, the runtime parser 218 begins execution of a firstrepetition structure that is used to iterate over each line of trainingdata. The training data can include vectors such as the vectors 602 and604 that each represent a class of log entries.

At line 4, the runtime parser 218 places a current line of training datainto an array, with a class number of the current line included in thelast position of the array and the other elements of the array includingcomponent type identifiers included in the vector corresponding to thecurrent line of training data. At line 5, the runtime parser 218extracts the class number of the current line of training data from thearray. For example, if the current line corresponds to the vector 602, aclass number of “0” can be extracted.

At line 6, the runtime parser 218 initializes a current node variable torefer to the root node. For example, the current node variable can referto the root node 612. At line 7, the runtime parser 218 begins executionof a second repetition structure that can be used to iterate over theelements of the array. At line 8, the runtime parser 218 extracts acurrent component type from the array.

At line 9, the runtime parser 218 determines whether the class numberassociated with the current line of training data is in a classcollection associated with the current node. If the class numberassociated with the current line is not in a class collection, theruntime parser 218 adds the class number to the classes collectionassociated with the current node. At line 10, the runtime parser 218increments an instance count associated with the current node.

At line 11, the runtime parse 218 determines whether all elements of thearray have been processed. If all lines of the array have not beenprocessed, the runtime parser 218 determines, at line 12, whether thechild nodes associated with the current node include the currentcomponent type. If the child nodes associated with the current node donot include the current component type, the runtime parser 218, at line13, creates a new node object. At line 14, the runtime parser 218 linksthe new node to the current node as a child node and associates thecurrent component type with the new node. At line 16, the runtime parser218 sets a current node reference to the newly created node.

If all lines of the array have been processed (e.g., based on thedetermination performed at line 11), the runtime parser 218, determines,at line 19, whether the current node includes a leaf node as a childnode. If the current node does not include a leaf node as a child node,the runtime parser 218 adds a leaf node, at line 20, as a child node ofthe current node. At line 22, the runtime parser 218 determines whetherthe class number corresponding to the current line is included in aclass collection associated with the leaf node, and if not, adds theclass number to the classes collection associated with the leaf node.

FIG. 8 is a flow chart of an example method for efficient identificationof log events in enterprise threat detection, according to animplementation. For clarity of presentation, the description thatfollows generally describes method 800 in the context of FIGS. 1-8.However, it will be understood that method 800 may be performed, forexample, by any other suitable system, environment, software, andhardware, or a combination of systems, environments, software, andhardware as appropriate.

At 802, a first set of log entries is identified. The first set of logentries can be, for example, training log entries. From 802, method 800proceeds to 804.

At 804, a plurality of log entry classes occurring in the first set oflog entries is determined. Each log entry in a given log entry class hasa same number, type, and ordering of components. Components can be ofdifferent data types. For instance, example components can includetimestamps, time values, IP addresses, variable text, literal text, useridentifiers, etc. From 804, method 800 proceeds to 806.

At 806, a vector of component type identifiers is determined for eachlog entry class. Each component type identifier in a vector identifies aposition and type of a component included in a log entry belonging tothe log entry class associated with the vector. From 806, method 800proceeds to 808.

At 808, a classification tree is created using the vectors. From 808,method 800 proceeds to 810. The classification tree can represent aplurality of candidate log entry classes. Each log entry class can beassociated with a unique log entry class identifier. Each log entryclass identifier can be included in a leaf node of the classificationtree. Each vector can be represented in the classification tree as apath beginning at a root node and ending at a respective leaf nodecorresponding to the log entry class associated with the vector. Eachrespective non-leaf node of the classification tree can correspond to aparticular token position of the unclassified log entry and to one ormore candidate log entry classes that are each represented by a sub-pathof the classification tree beginning at the root node and ending at therespective non-leaf node. Each branch of the classification tree can beassociated with a component type identifier included in one or morevectors. Each branch can be associated with a test which evaluates acurrent token of the unclassified log message to determine whether thecurrent token matches a component type associated with the branch.

At 810, an unclassified log entry not included in the first set of logentries is identified. For example, the unclassified log entry can bereceived from a log-providing system. From 810, method 800 proceeds to812.

At 812, a log entry class is assigned to the unclassified log entryusing the classification tree to create a classified log entry.Assigning the log entry class to the unclassified log entry can includeevaluating tokens of the unclassified log entry in accordance with theclassification tree. Candidate log entry classes can be eliminated fromconsideration until one remaining candidate log entry class remains, andthe one remaining candidate log entry class can be assigned to theunclassified log entry.

Evaluating tokens can include identifying a current token of theunclassified log message and one or more respective branches of acurrent node of the classification tree. A test for each respectivebranch can be identified and performed, each test evaluating the currenttoken of the unclassified log message to determine whether the currenttoken matches a component type associated with the branch. A respectivebranch can be followed to a next node of the classification tree when anoutcome of the test associated with the branch indicates a match betweenthe current token and the component type associated with the branch.Assigning the log entry class can include determining that the next nodeis associated with the one remaining candidate log entry class and noother candidate log entry classes and assigning the one remainingcandidate log entry class to the unclassified log entry. From 812,method 800 proceeds to 814.

At 814, one or more security threat patterns is evaluated using theclassified log entry. For example, a threat pattern that includes thelog entry class, and a threat associated with the threat pattern, can beidentified. One or more actions can be performed in response toidentifying the threat.

FIG. 9 is a block diagram 900 of an exemplary computer 902 used in theEDCS, according to an implementation. The illustrated computer 902 isintended to encompass any computing device such as a server, desktopcomputer, laptop/notebook computer, wireless data port, smart phone,personal data assistant (PDA), tablet computing device, one or moreprocessors within these devices, or any other suitable processingdevice, including both physical and/or virtual instances of thecomputing device. Additionally, the computer 902 may comprise a computerthat includes an input device, such as a keypad, keyboard, touch screen,or other device that can accept user information, and an output devicethat conveys information associated with the operation of the computer902, including digital data, visual and/or audio information, or a GUI.

The computer 902 can process for/serve as a client, a server, and/or anyother component of the EDCS (whether or not illustrated). Theillustrated computer 902 is communicably coupled with a network 930(e.g., network 140 of FIGS. 1 and 2). In some implementations, one ormore components of the computer 902 may be configured to operate withina cloud-computing-based environment.

At a high level, the computer 902 is an electronic computing deviceoperable to receive, transmit, process, store, or manage data andinformation associated with the EDCS. According to some implementations,the computer 902 may also include or be communicably coupled with acloud-computing server, application server, e-mail server, web server,caching server, streaming data server, business intelligence (BI)server, and/or other server.

The computer 902 can generate requests to transmit over network 930(e.g., as a client device) or receive requests over network 930 from aclient application (e.g., a web browser or other application) andresponding to the received requests by processing the said requests inan appropriate software application, hardware, etc. In addition,requests may also be sent to the computer 902 from internal users (e.g.,from a command console or by other appropriate access method), externalor third-parties, other automated applications, as well as any otherappropriate entities, individuals, systems, or computers.

Each of the components of the computer 902 can communicate using asystem bus 903. In some implementations, any and/or all the componentsof the computer 902, both hardware and/or software, may interface witheach other and/or the interface 904 over the system bus 903 using an API912 and/or a service layer 913. The API 912 may include specificationsfor routines, data structures, and object classes. The API 912 may beeither computer-language independent or dependent and refer to acomplete interface, a single function, or even a set of APIs. Theservice layer 913 provides software services to the computer 902 and/orthe EDCS. The functionality of the computer 902 may be accessible forall service consumers using this service layer. Software services, suchas those provided by the service layer 913, provide reusable, definedbusiness functionalities through a defined interface. For example, theinterface may be software written in JAVA, C++, ABAP, or other suitablelanguage providing data in extensible markup language (XML) format orother suitable format. While illustrated as an integrated component ofthe computer 902, alternative implementations may illustrate the API 912and/or the service layer 913 as stand-alone components in relation toother components of the computer 902 and/or the EDCS. Moreover, any orall parts of the API 912 and/or the service layer 913 may be implementedas child or sub-modules of another software module, enterpriseapplication, or hardware module without departing from the scope of thisdisclosure.

The computer 902 includes an interface 904. Although illustrated as asingle interface 904 in FIG. 9, two or more interfaces 904 may be usedaccording to particular needs, desires, or particular implementations ofthe computer 902 and/or the EDCS. The interface 904 is used by thecomputer 902 for communicating with other systems in a distributedenvironment—including within the EDCS—connected to the network 930(whether illustrated or not). Generally, the interface 904 compriseslogic encoded in software and/or hardware in a suitable combination andoperable to communicate with the network 930. More specifically, theinterface 904 may comprise software supporting one or more communicationprotocols associated with communications such that the network 930 orinterface's hardware is operable to communicate physical signals withinand outside of the illustrated EDCS.

The computer 902 includes a processor 905. Although illustrated as asingle processor 905 in FIG. 9, two or more processors may be usedaccording to particular needs, desires, or particular implementations ofthe computer 902 and/or the EDCS. Generally, the processor 905 executesinstructions and manipulates data to perform the operations of thecomputer 902. Specifically, the processor 905 executes the functionalityrequired for efficient identification of log events in enterprise threatdetection.

The computer 902 also includes a database 906 and memory 908 that holddata for the computer 902 and/or other components of the EDCS. Althoughillustrated as a single database 906 and memory 908 in FIG. 9, two ormore databases 906 and memories 908 may be used according to particularneeds, desires, or particular implementations of the computer 902 and/orthe EDCS. While database 906 and memory 908 are illustrated as integralcomponents of the computer 902, in alternative implementations, thedatabase 906 and memory 908 can be external to the computer 902 and/orthe EDCS. In some implementations, the database 906 can be aconventional database or an in-memory database, or a mix of both. Insome implementations, the database 906 and memory 908 can be combinedinto one component.

The application 907 is an algorithmic software engine providingfunctionality according to particular needs, desires, or particularimplementations of the computer 902 and/or the EDCS, particularly withrespect to functionalities required for efficient identification of logevents in enterprise threat detection. For example, application 907 canserve as the event stream processor 110, the runtime parser 218, or anyother component of the EDCS (whether or not illustrated). Further,although illustrated as a single application 907, the application 907may be implemented as multiple applications 907 on the computer 902. Inaddition, although illustrated as integral to the computer 902, inalternative implementations, the application 907 can be external to thecomputer 902 and/or the EDCS.

There may be any number of computers 902 associated with, or externalto, the EDCS and communicating over network 930. Further, the term“client,” “user,” and other appropriate terminology may be usedinterchangeably as appropriate without departing from the scope of thisdisclosure. Moreover, this disclosure contemplates that many users mayuse one computer 902, or that one user may use multiple computers 902.

Implementations of the subject matter and the functional operationsdescribed in this specification can be implemented in digital electroniccircuitry, in tangibly embodied computer software or firmware, incomputer hardware, including the structures disclosed in thisspecification and their structural equivalents, or in combinations ofone or more of them. Implementations of the subject matter described inthis specification can be implemented as one or more computer programs,i.e., one or more modules of computer program instructions encoded on atangible, non-transitory computer-storage medium for execution by, or tocontrol the operation of, data processing apparatus. Alternatively or inaddition, the program instructions can be encoded on an artificiallygenerated propagated signal, e.g., a machine-generated electrical,optical, or electromagnetic signal that is generated to encodeinformation for transmission to suitable receiver apparatus forexecution by a data processing apparatus. The computer-storage mediumcan be a machine-readable storage device, a machine-readable storagesubstrate, a random or serial access memory device, or a combination ofone or more of them.

The terms “data processing apparatus,” “computer,” or “electroniccomputer device” (or equivalent as understood by one of ordinary skillin the art) refer to data processing hardware and encompass all kinds ofapparatus, devices, and machines for processing data, including by wayof example, a programmable processor, a computer, or multiple processorsor computers. The apparatus can also be or further include specialpurpose logic circuitry, e.g., a central processing unit (CPU), an FPGA(field programmable gate array), or an ASIC (application-specificintegrated circuit). In some implementations, the data processingapparatus and/or special purpose logic circuitry may be hardware-basedand/or software-based. The apparatus can optionally include code thatcreates an execution environment for computer programs, e.g., code thatconstitutes processor firmware, a protocol stack, a database managementsystem, an operating system, or a combination of one or more of them.The present disclosure contemplates the use of data processingapparatuses with or without conventional operating systems, for exampleLINUX, UNIX, WINDOWS, MAC OS, ANDROID, IOS or any other suitableconventional operating system.

A computer program, which may also be referred to or described as aprogram, software, a software application, a module, a software module,a script, or code, can be written in any form of programming language,including compiled or interpreted languages, or declarative orprocedural languages, and it can be deployed in any form, including as astand-alone program or as a module, component, subroutine, or other unitsuitable for use in a computing environment. A computer program may, butneed not, correspond to a file in a file system. A program can be storedin a portion of a file that holds other programs or data, e.g., one ormore scripts stored in a markup language document, in a single filededicated to the program in question, or in multiple coordinated files,e.g., files that store one or more modules, sub-programs, or portions ofcode. A computer program can be deployed to be executed on one computeror on multiple computers that are located at one site or distributedacross multiple sites and interconnected by a communication network.While portions of the programs illustrated in the various figures areshown as individual modules that implement the various features andfunctionality through various objects, methods, or other processes, theprograms may instead include a number of sub-modules, third-partyservices, components, libraries, and such, as appropriate. Conversely,the features and functionality of various components can be combinedinto single components as appropriate.

The processes and logic flows described in this specification can beperformed by one or more programmable computers executing one or morecomputer programs to perform functions by operating on input data andgenerating output. The processes and logic flows can also be performedby, and apparatus can also be implemented as, special purpose logiccircuitry, e.g., a CPU, an FPGA, or an ASIC.

Computers suitable for the execution of a computer program can be basedon general or special purpose microprocessors, both, or any other kindof CPU. Generally, a CPU will receive instructions and data from aread-only memory (ROM) or a random access memory (RAM) or both. Theessential elements of a computer are a CPU for performing or executinginstructions and one or more memory devices for storing instructions anddata. Generally, a computer will also include, or be operatively coupledto, receive data from or transfer data to, or both, one or more massstorage devices for storing data, e.g., magnetic, magneto-optical disks,or optical disks. However, a computer need not have such devices.Moreover, a computer can be embedded in another device, e.g., a mobiletelephone, a personal digital assistant (PDA), a mobile audio or videoplayer, a game console, a global positioning system (GPS) receiver, or aportable storage device, e.g., a universal serial bus (USB) flash drive,to name just a few.

Computer-readable media (transitory or non-transitory, as appropriate)suitable for storing computer program instructions and data include allforms of non-volatile memory, media and memory devices, including by wayof example semiconductor memory devices, e.g., erasable programmableread-only memory (EPROM), electrically erasable programmable read-onlymemory (EEPROM), and flash memory devices; magnetic disks, e.g.,internal hard disks or removable disks; magneto-optical disks; andCD-ROM, DVD+/−R, DVD-RAM, and DVD-ROM disks. The memory may storevarious objects or data, including caches, classes, frameworks,applications, backup data, jobs, web pages, web page templates, databasetables, repositories storing business and/or dynamic information, andany other appropriate information including any parameters, variables,algorithms, instructions, rules, constraints, or references thereto.Additionally, the memory may include any other appropriate data, such aslogs, policies, security or access data, reporting files, as well asothers. The processor and the memory can be supplemented by, orincorporated in, special purpose logic circuitry.

To provide for interaction with a user, implementations of the subjectmatter described in this specification can be implemented on a computerhaving a display device, e.g., a CRT (cathode ray tube), LCD (liquidcrystal display), LED (Light Emitting Diode), or plasma monitor, fordisplaying information to the user and a keyboard and a pointing device,e.g., a mouse, trackball, or trackpad by which the user can provideinput to the computer. Input may also be provided to the computer usinga touchscreen, such as a tablet computer surface with pressuresensitivity, a multi-touch screen using capacitive or electric sensing,or other type of touchscreen. Other kinds of devices can be used toprovide for interaction with a user as well; for example, feedbackprovided to the user can be any form of sensory feedback, e.g., visualfeedback, auditory feedback, or tactile feedback; and input from theuser can be received in any form, including acoustic, speech, or tactileinput. In addition, a computer can interact with a user by sendingdocuments to and receiving documents from a device that is used by theuser; for example, by sending web pages to a web browser on a user'sclient device in response to requests received from the web browser.

The term “graphical user interface,” or “GUI,” may be used in thesingular or the plural to describe one or more graphical user interfacesand each of the displays of a particular graphical user interface.Therefore, a GUI may represent any graphical user interface, includingbut not limited to, a web browser, a touch screen, or a command lineinterface (CLI) that processes information and efficiently presents theinformation results to the user. In general, a GUI may include aplurality of user interface (UI) elements, some or all associated with aweb browser, such as interactive fields, pull-down lists, and buttonsoperable by the business suite user. These and other UI elements may berelated to or represent the functions of the web browser.

Implementations of the subject matter described in this specificationcan be implemented in a computing system that includes a back-endcomponent, e.g., as a data server, or that includes a middlewarecomponent, e.g., an application server, or that includes a front-endcomponent, e.g., a client computer having a graphical user interface ora Web browser through which a user can interact with an implementationof the subject matter described in this specification, or anycombination of one or more such back-end, middleware, or front-endcomponents. The components of the system can be interconnected by anyform or medium of wireline and/or wireless digital data communication,e.g., a communication network. Examples of communication networksinclude a local area network (LAN), a radio access network (RAN), ametropolitan area network (MAN), a wide area network (WAN), WorldwideInteroperability for Microwave Access (WIMAX), a wireless local areanetwork (WLAN) using, for example, 802.11 a/b/g/n and/or 802.20, all ora portion of the Internet, and/or any other communication system orsystems at one or more locations. The network may communicate with, forexample, Internet Protocol (IP) packets, Frame Relay frames,Asynchronous Transfer Mode (ATM) cells, voice, video, data, and/or othersuitable information between network addresses.

The computing system can include clients and servers. A client andserver are generally remote from each other and typically interactthrough a communication network. The relationship of client and serverarises by virtue of computer programs running on the respectivecomputers and having a client-server relationship to each other.

In some implementations, any or all of the components of the computingsystem, both hardware and/or software, may interface with each otherand/or the interface using an application programming interface (API)and/or a service layer. The API may include specifications for routines,data structures, and object classes. The API may be either computerlanguage independent or dependent and refer to a complete interface, asingle function, or even a set of APIs. The service layer providessoftware services to the computing system. The functionality of thevarious components of the computing system may be accessible for allservice consumers using this service layer. Software services providereusable, defined business functionalities through a defined interface.For example, the interface may be software written in JAVA, C++, orother suitable language providing data in extensible markup language(XML) format or other suitable format. The API and/or service layer maybe an integral and/or a stand-alone component in relation to othercomponents of the computing system. Moreover, any or all parts of theservice layer may be implemented as child or sub-modules of anothersoftware module, enterprise application, or hardware module withoutdeparting from the scope of this disclosure.

While this specification contains many specific implementation details,these should not be construed as limitations on the scope of anyinvention or on the scope of what may be claimed, but rather asdescriptions of features that may be specific to particularimplementations of particular inventions. Certain features that aredescribed in this specification in the context of separateimplementations can also be implemented in combination in a singleimplementation. Conversely, various features that are described in thecontext of a single implementation can also be implemented in multipleimplementations separately or in any suitable sub-combination. Moreover,although features may be described above as acting in certaincombinations and even initially claimed as such, one or more featuresfrom a claimed combination can in some cases be excised from thecombination, and the claimed combination may be directed to asub-combination or variation of a sub-combination.

Particular implementations of the subject matter have been described.Other implementations, alterations, and permutations of the describedimplementations are within the scope of the following claims as will beapparent to those skilled in the art. While operations are depicted inthe drawings or claims in a particular order, this should not beunderstood as requiring that such operations be performed in theparticular order shown or in sequential order, or that all illustratedoperations be performed (some operations may be considered optional), toachieve desirable results. In certain circumstances, multitasking and/orparallel processing may be advantageous and performed as deemedappropriate.

Moreover, the separation and/or integration of various system modulesand components in the implementations described above should not beunderstood as requiring such separation and/or integration in allimplementations, and it should be understood that the described programcomponents and systems can generally be integrated together in a singlesoftware product or packaged into multiple software products.

Accordingly, the above description of example implementations does notdefine or constrain this disclosure. Other changes, substitutions, andalterations are also possible without departing from the spirit andscope of this disclosure.

What is claimed is:
 1. A computer-implemented method executed by atleast one processor, the method comprising: identifying, by the at leastone processor, a first set of log entries; determining, by the at leastone processor, a plurality of log entry classes occurring in the firstset of log entries, each log entry in a given log entry class having asame number, type, and ordering of components; determining, by the atleast one processor and for each log entry class, a vector of componenttype identifiers for a given log entry class, each identifier in thevector identifying a position and type of a component included in a logentry belonging to the given log entry class; creating, by the at leastone processor, a classification tree using the vectors, wherein theclassification tree comprises a plurality of candidate log entryclasses, wherein each log entry class is associated with a leaf node ofthe classification tree, wherein each vector is represented in theclassification tree as a path beginning at a root node and ending at arespective leaf node corresponding to the log entry class associatedwith the vector, and wherein each respective non-leaf node of theclassification tree corresponds to a particular token position of anunclassified log entry and to one or more candidate log entry classesthat are each represented by a sub-path of the classification treebeginning at the root node and ending at the respective non-leaf node;identifying, by the at least one processor, an unclassified log entrynot included in the first set of log entries; assigning, by the at leastone processor, a log entry class to the unclassified log entry using theclassification tree to create a classified log entry, wherein assigningthe log entry class to the unclassified log entry using theclassification tree comprises: evaluating tokens of the unclassified logentry in accordance with the classification tree by eliminatingcandidate log entry classes from consideration until one remainingcandidate log entry class remains, wherein assigning the log entry classcomprises assigning the one remaining candidate log entry class to theunclassified log entry, and wherein evaluating tokens of theunclassified log entry comprises: identifying a current token of theunclassified log entry and one or more respective branches of theidentified current node of the classification tree; determining, foreach of the one or more respective branches of the identified currenttoken, whether the identified current token matches a component typeassociated with the respective branch; following a respective branch toa next node of the classification tree in response to determining thatthe identified current token matches the component type associated withthe branch; in response to determining that the next node is a non-leafnode and that the next node is associated with only one remainingcandidate log entry class and no other candidate log entry classes,assigning the one remaining candidate log entry class to theunclassified log entry; and in response to determining that the nextnode is associated with two or more remaining candidate log entryclasses, returning to the determining operation for a next token of theunclassified log entry; and evaluating, by the at least one processor,one or more security threat patterns using the classified log entry. 2.The method of claim 1, wherein each log entry class is associated with aunique log entry class identifier.
 3. The method of claim 2, whereineach log entry class identifier is included in a leaf node of theclassification tree.
 4. The method of claim 1, wherein each branch ofthe classification tree is associated with a component type identifierof one or more vectors.
 5. A non-transitory, computer-readable mediumstoring computer-readable instructions, the instructions executable by acomputer and configured to instruct the computer to: identify a firstset of log entries; determine a plurality of log entry classes occurringin the first set of log entries, each log entry in a given log entryclass having a same number, type, and ordering of components; determine,for each log entry class, a vector of component type identifiers for agiven log entry class, each identifier in the vector identifying aposition and type of a component included in a log entry belonging tothe given log entry class; create a classification tree using thevectors, wherein the classification tree comprises a plurality ofcandidate log entry classes, wherein each log entry class is associatedwith a leaf node of the classification tree, wherein each vector isrepresented in the classification tree as a path beginning at a rootnode and ending at a respective leaf node corresponding to the log entryclass associated with the vector, and wherein each respective non-leafnode of the classification tree corresponds to a particular tokenposition of an unclassified log entry and to one or more candidate logentry classes that are each represented by a sub-path of theclassification tree beginning at the root node and ending at therespective non-leaf node; identify an unclassified log entry notincluded in the first set of log entries; assign a log entry class tothe unclassified log entry using the classification tree to create aclassified log entry, wherein assigning the log entry class to theunclassified log entry using the classification tree comprises:evaluating tokens of the unclassified log entry in accordance with theclassification tree by eliminating candidate log entry classes fromconsideration until one remaining candidate log entry class remains,wherein assigning the log entry class comprises assigning the oneremaining candidate log entry class to the unclassified log entry, andwherein evaluating tokens of the unclassified log entry comprises:identifying a current token of the unclassified log entry and one ormore respective branches of the identified current node of theclassification tree; determining, for each of the one or more respectivebranches of the identified current token, whether the identified currenttoken matches a component type associated with the respective branch;following a respective branch to a next node of the classification treein response to determining that the identified current token matches thecomponent type associated with the branch; in response to determiningthat the next node is a non-leaf node and that the next node isassociated with only one remaining candidate log entry class and noother candidate log entry classes, assigning the one remaining candidatelog entry class to the unclassified log entry; and in response todetermining that the next node is associated with two or more remainingcandidate log entry classes, returning to the determining operation fora next token of the unclassified log entry; and evaluate one or moresecurity threat patterns using the classified log entry.
 6. A system,comprising: a memory; at least one hardware processor interoperablycoupled with the memory and configured to: identify a first set of logentries; determine a plurality of log entry classes occurring in thefirst set of log entries, each log entry in a given log entry classhaving a same number, type, and ordering of components; determine, foreach log entry class, a vector of component type identifiers for a givenlog entry class, each identifier in the vector identifying a positionand type of a component included in a log entry belonging to the givenlog entry class; create a classification tree using the vectors, whereinthe classification tree comprises a plurality of candidate log entryclasses, wherein each log entry class is associated with a leaf node ofthe classification tree, wherein each vector is represented in theclassification tree as a path beginning at a root node and ending at arespective leaf node corresponding to the log entry class associatedwith the vector, and wherein each respective non-leaf node of theclassification tree corresponds to a particular token position of anunclassified log entry and to one or more candidate log entry classesthat are each represented by a sub-path of the classification treebeginning at the root node and ending at the respective non-leaf node;identify an unclassified log entry not included in the first set of logentries; assign a log entry class to the unclassified log entry usingthe classification tree to create a classified log entry, whereinassigning the log entry class to the unclassified log entry using theclassification tree comprises: evaluating tokens of the unclassified logentry in accordance with the classification tree by eliminatingcandidate log entry classes from consideration until one remainingcandidate log entry class remains, wherein assigning the log entry classcomprises assigning the one remaining candidate log entry class to theunclassified log entry, and wherein evaluating tokens of theunclassified log entry comprises: identifying a current token of theunclassified log entry and one or more respective branches of theidentified current node of the classification tree; determining, foreach of the one or more respective branches of the identified currenttoken, whether the identified current token matches a component typeassociated with the respective branch; following a respective branch toa next node of the classification tree in response to determining thatthe identified current token matches the component type associated withthe branch; in response to determining that the next node is a non-leafnode and that the next node is associated with only one remainingcandidate log entry class and no other candidate log entry classes,assigning the one remaining candidate log entry class to theunclassified log entry; and in response to determining that the nextnode is associated with two or more remaining candidate log entryclasses, returning to the determining operation for a next token of theunclassified log entry; and evaluate one or more security threatpatterns using the classified log entry.
 7. The non-transitory,computer-readable medium of claim 5, wherein each log entry class isassociated with a unique log entry class identifier.
 8. Thenon-transitory, computer-readable medium of claim 7, wherein each logentry class identifier is included in a leaf node of the classificationtree.
 9. The non-transitory, computer-readable medium of claim 5,wherein each branch of the classification tree is associated with acomponent type identifier of one or more vectors.
 10. The system ofclaim 6, wherein each log entry class is associated with a unique logentry class identifier.
 11. The system of claim 10, wherein each logentry class identifier is included in a leaf node of the classificationtree.
 12. The system of claim 6, wherein each branch of theclassification tree is associated with a component type identifier ofone or more vectors.